Commitment and Oblivious Transfer in the Bounded Storage Model With Errors

Commitment and Oblivious Transfer in the Bounded Storage Model with Errors

The bounded storage model restricts the memory of an adversary in a cryptographic protocol, rather than restricting its computational power, making information theoretically secure protocols feasible. We present the first protocols for commitment and oblivious transfer in the bounded storage model with errors, i.e., the model where the public random sources available to the two parties are not ...

Oblivious Transfer in the Bounded Storage Model

Building on a previous important work of Cachin, Crépeau, and Marcil [15], we present a provably secure and more efficient protocol for ( 2 1 ) -Oblivious Transfer with a storage-bounded receiver. A public random string of n bits long is employed, and the protocol is secure against any receiver who can store γn bits, γ < 1. Our work improves the work of CCM [15] in two ways. First, the CCM prot...

Efficient Oblivious Transfer in the Bounded-Storage Model

In this paper we propose an efficient OT 1 scheme in the bounded storage model, which is provably secure without complexity assumptions. Under the assumption that a public random string of M bits is broadcasted, the protocol is secure against any computationally unbounded dishonest receiver who can store τM bits, τ < 1. The protocol requires the sender and the receiver to store N · O( √ kM) bit...

Oblivious Transfer with a Memory-Bounded Receiver

We propose a protocol for oblivious transfer that is unconditionally secure under the sole assumption that the memory size of the receiver is bounded. The model assumes that a random bit string slightly larger than the receiver’s memory is broadcast (either by the sender or by a third party). In our construction, both parties need memory of size in (n2 2 ) for some < 12 , when a random string o...

Constant - Round Oblivious Transferin the Bounded Storage